Transversal Helly numbers, pinning theorems and projection of simplicial complexes
Identifieur interne : 001F66 ( Main/Exploration ); précédent : 001F65; suivant : 001F67Transversal Helly numbers, pinning theorems and projection of simplicial complexes
Auteurs : Xavier Goaoc [France]Source :
Descripteurs français
English descriptors
Abstract
The efficient resolution of various problems in computational geometry, for instance visibility computation or shape approximation, raises new questions in line geometry, a classical area going back to the mid-19th century. This thesis fits into this theme, and studies Helly numbers of certain sets of lines, an index related to certain basis theorems arising in computational geometry and combinatorial optimization. Formally, the Helly number of a family of sets with empty intersection is the size of its largest inclusion-wise minimal sub-family with empty intersection. For $d\ge 2$ let $h_d$ denote the least integer such that for any family $\{B_1, \ldots, B_n\}$ of pairwise disjoint balls of equal radius in $R^d$, the Helly number of $\{T(B_1), \ldots, T(B_n)\}$ is at most $h_d$, where $T(B_i)$ denotes the set of lines intersecting $B_i$. In 1957, Ludwig Danzer showed that $h_2$ equals $5$ and conjectured that $h_d$ is finite for all $d \ge 2$ and increases with $d$. We establish that $h_d$ is at least $2d-1$ and at most $4d-1$ for any $d \ge 2$, proving the first conjecture and providing evidence in support of the second one. To study Danzer's conjectures, we introduce the pinning number, a local analogue of the Helly number that is related to grasping questions studied in robotics. We further show that pinning numbers can be bounded for sufficiently generic families of polyhedra or ovaloids in $R^3$, two situations where Helly numbers can be arbitrarily large. A theorem of Tverberg asserts that when $\{B_1, \ldots, B_n\}$ are disjoint translates of a convex figure in the plane, the Helly number of $\{T(B_1), \ldots, T(B_n)\}$ is at most $5$. Although quite different, both our and Tverberg's proofs use, in some way, that the intersection of at least two $T(B_i)$'s has a bounded number of connected components, each contractible. Using considerations on homology of projection of simplicial complexes and posets, we unify the two proofs and show that such topological condition suffice to ensure explicit bounds on Helly numbers.
Url:
Affiliations:
- France
- Grand Est, Lorraine (région)
- Nancy
- Institut national polytechnique de Lorraine, Université Nancy 2, Université de Lorraine
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: 004F58
- to stream Hal, to step Curation: 004F58
- to stream Hal, to step Checkpoint: 001A13
- to stream Main, to step Merge: 002008
- to stream Main, to step Curation: 001F66
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Transversal Helly numbers, pinning theorems and projection of simplicial complexes</title>
<title xml:lang="fr">Nombres de Helly, théorèmes d'épinglement et projection de complexes simpliciaux</title>
<author><name sortKey="Goaoc, Xavier" sort="Goaoc, Xavier" uniqKey="Goaoc X" first="Xavier" last="Goaoc">Xavier Goaoc</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2573" status="OLD"><idno type="RNSR">200518305E</idno>
<orgName>Effective Geometric Algorithms for Surfaces and Visibility</orgName>
<orgName type="acronym">VEGAS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/vegas</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:tel-00650204</idno>
<idno type="halId">tel-00650204</idno>
<idno type="halUri">https://tel.archives-ouvertes.fr/tel-00650204</idno>
<idno type="url">https://tel.archives-ouvertes.fr/tel-00650204</idno>
<date when="2011-12-07">2011-12-07</date>
<idno type="wicri:Area/Hal/Corpus">004F58</idno>
<idno type="wicri:Area/Hal/Curation">004F58</idno>
<idno type="wicri:Area/Hal/Checkpoint">001A13</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">001A13</idno>
<idno type="wicri:Area/Main/Merge">002008</idno>
<idno type="wicri:Area/Main/Curation">001F66</idno>
<idno type="wicri:Area/Main/Exploration">001F66</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Transversal Helly numbers, pinning theorems and projection of simplicial complexes</title>
<title xml:lang="fr">Nombres de Helly, théorèmes d'épinglement et projection de complexes simpliciaux</title>
<author><name sortKey="Goaoc, Xavier" sort="Goaoc, Xavier" uniqKey="Goaoc X" first="Xavier" last="Goaoc">Xavier Goaoc</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2573" status="OLD"><idno type="RNSR">200518305E</idno>
<orgName>Effective Geometric Algorithms for Surfaces and Visibility</orgName>
<orgName type="acronym">VEGAS</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/vegas</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="IdRef">02636817X</idno>
<idno type="ISNI">0000000122597504</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>Discrete and computational geometry</term>
<term>Helly's theorem</term>
<term>Line geometry</term>
</keywords>
<keywords scheme="mix" xml:lang="fr"><term>Géométrie algorithmique et combinatoire</term>
<term>Géométrie des droites</term>
<term>Théorème de Helly</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The efficient resolution of various problems in computational geometry, for instance visibility computation or shape approximation, raises new questions in line geometry, a classical area going back to the mid-19th century. This thesis fits into this theme, and studies Helly numbers of certain sets of lines, an index related to certain basis theorems arising in computational geometry and combinatorial optimization. Formally, the Helly number of a family of sets with empty intersection is the size of its largest inclusion-wise minimal sub-family with empty intersection. For $d\ge 2$ let $h_d$ denote the least integer such that for any family $\{B_1, \ldots, B_n\}$ of pairwise disjoint balls of equal radius in $R^d$, the Helly number of $\{T(B_1), \ldots, T(B_n)\}$ is at most $h_d$, where $T(B_i)$ denotes the set of lines intersecting $B_i$. In 1957, Ludwig Danzer showed that $h_2$ equals $5$ and conjectured that $h_d$ is finite for all $d \ge 2$ and increases with $d$. We establish that $h_d$ is at least $2d-1$ and at most $4d-1$ for any $d \ge 2$, proving the first conjecture and providing evidence in support of the second one. To study Danzer's conjectures, we introduce the pinning number, a local analogue of the Helly number that is related to grasping questions studied in robotics. We further show that pinning numbers can be bounded for sufficiently generic families of polyhedra or ovaloids in $R^3$, two situations where Helly numbers can be arbitrarily large. A theorem of Tverberg asserts that when $\{B_1, \ldots, B_n\}$ are disjoint translates of a convex figure in the plane, the Helly number of $\{T(B_1), \ldots, T(B_n)\}$ is at most $5$. Although quite different, both our and Tverberg's proofs use, in some way, that the intersection of at least two $T(B_i)$'s has a bounded number of connected components, each contractible. Using considerations on homology of projection of simplicial complexes and posets, we unify the two proofs and show that such topological condition suffice to ensure explicit bounds on Helly numbers.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Nancy</li>
</settlement>
<orgName><li>Institut national polytechnique de Lorraine</li>
<li>Université Nancy 2</li>
<li>Université de Lorraine</li>
</orgName>
</list>
<tree><country name="France"><region name="Grand Est"><name sortKey="Goaoc, Xavier" sort="Goaoc, Xavier" uniqKey="Goaoc X" first="Xavier" last="Goaoc">Xavier Goaoc</name>
</region>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001F66 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001F66 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= Hal:tel-00650204 |texte= Transversal Helly numbers, pinning theorems and projection of simplicial complexes }}
This area was generated with Dilib version V0.6.33. |